An Extremal Graph Problem with a Transcendental Solution
نویسندگان
چکیده
منابع مشابه
An extremal graph problem with a transcendental solution
We prove that the number of multigraphs with vertex set {1, . . . , n} such that every four vertices span at most nine edges is a +o(n) where a is transcendental (assuming Schanuel’s conjecture from number theory). This is an easy consequence of the solution to a related problem about maximizing the product of the edge multiplicities in certain multigraphs, and appears to be the first explicit ...
متن کاملAn Extremal Problem in Graph Theory
G(?z; I) will denote a graph of n vertices and 1 edges. Let fO(lz, K) be the smallest integer such that there is a G (n; f,, (n, k)) in which for every set of K vertices there is a vertex joined to each of these. Thus for example fO(3, 2) = 3 since in a triangle each pair of vertices is joined to a third. It can readily be checked that f,(4, 2) = 5 (the extremal graph consists of a complete 4-g...
متن کاملAn Extremal Problem for Sets with Applications to Graph Theory
We prove that h<J-J:_, 1 " ;' a). This result is best possible and has some interesting consequences. Its proof uses multilinear techniques (exterior algebra).
متن کاملTranscendental Lattice of an Extremal Elliptic Surface
We develop an algorithm computing the transcendental lattice and the Mordell–Weil group of an extremal elliptic surface. As an example, we compute the lattices of four exponentially large series of surfaces
متن کاملOn a problem in extremal graph theory
The number T*(n, k) is the least positive integer such that every graph with n = (*:I) + t vertices (t > 0) and at least T*(n, k) edges contains k mutually vertex-disjoint complete subgraphs S, , S, ,..., Sk where S, has ivertices, I < i Q k. Obviously T*(n, k) > T(n, k), the Turan number of edges for a Ki . It is shown that if n > gkk” then equality holds and that there is c :0 such that for (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2018
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548318000299